Metric Dimensions of Bicyclic Graphs

نویسندگان

چکیده

The distance d(va,vb) between two vertices of a simple connected graph G is the length shortest path va and vb. Vertices va,vb are considered to be resolved by vertex v if d(va,v)≠d(vb,v). An ordered set W={v1,v2,v3,…,vs}⊆V(G) said resolving for G, any va,vb∈V(G),∃vi∈W∋d(va,vi)≠d(vb,vi). representation with respect W denoted r(v|W) an s-vector(s-tuple) (d(v,v1),d(v,v2),d(v,v3),…,d(v,vs)). Using r(v|W), we can say that if, va,vb∈V(G), have r(va|W)≠r(vb|W). A minimal termed metric basis G. cardinality called dimension represented dim(G). In this article, study types bicyclic graphs. obtained results prove they constant dimension.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the harmonic index of bicyclic graphs

The harmonic index of a graph $G$, denoted by $H(G)$, is defined asthe sum of weights $2/[d(u)+d(v)]$ over all edges $uv$ of $G$, where$d(u)$ denotes the degree of a vertex $u$. Hu and Zhou [Y. Hu and X. Zhou, WSEAS Trans. Math. {bf 12} (2013) 716--726] proved that for any bicyclic graph $G$ of order $ngeq 4$, $H(G)le frac{n}{2}-frac{1}{15}$ and characterize all extremal bicyclic graphs.In this...

متن کامل

Inverses of bicyclic graphs

A graph G is said to be nonsingular (resp., singular) if its adjacency matrix A(G) is nonsingular (resp., singular). The inverse of a nonsingular graph G is the unique weighted graph whose adjacency matrix is similar to the inverse of the adjacency matrix A(G) via a diagonal matrix of ±1s. Consider connected bipartite graphs with unique perfect matchings such that the graph obtained by contract...

متن کامل

Semiharmonic bicyclic graphs

Classification of harmonic and semiharmonic graphs according to their cyclomatic number became of interest recently. All finite harmonic graphs with up to four independent cycles, as well as all finite semiharmonic graphs with at most one cycle were determined. Here, we determine all finite semiharmonic bicyclic graphs. Besides that, we present several methods to construct semiharmonic graphs f...

متن کامل

Hosoya Indices of Bicyclic Graphs

Given a molecular graph G, the Hosoya index Z(G) of G is defined as the total number of the matchings of the graph. Let Bn denote the set of bicyclic graphs on n vertices. In this paper, the minimal, the second-, the third-, the fourth-, and the fifth-minimal Hosoya indices of bicyclic graphs in the set Bn are characterized.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics

سال: 2023

ISSN: ['2227-7390']

DOI: https://doi.org/10.3390/math11040869